@InProceedings{AraujoJorg:2004:CuDePo,
               author = "Araujo, Bruno Rodrigues de and Jorge, Joaquim Armando Pires",
          affiliation = "{Department of Information Systems and Computer Engineering} and 
                         {INESC-ID/IST/Technical University of Lisbon} and R. Alves Redol, 
                         1000-29 Lisbon, PORTUGAL",
                title = "Curvature Dependent Polygonization of Implicit Surfaces",
            booktitle = "Proceedings...",
                 year = "2004",
               editor = "Ara{\'u}jo, Arnaldo de Albuquerque and Comba, Jo{\~a}o Luiz Dihl 
                         and Navazo, Isabel and Sousa, Ant{\^o}nio Augusto de",
         organization = "Brazilian Symposium on Computer Graphics and Image Processing, 17. 
                         (SIBGRAPI) - Ibero-American Symposium on Computer Graphics, 2 
                         (SIACG)",
            publisher = "IEEE Computer Society",
              address = "Los Alamitos",
             keywords = "implicit surfaces, adaptive polygonization, hessian curvature.",
             abstract = "We present an algorithm for polygonizing closed implicit surfaces, 
                         which produces meshes adapted to the local curvature of the 
                         surface. Our method is similar to, but not based on, Marching 
                         Triangles, in that we start from a point on the surface and 
                         develop a mesh from that point using a surface-tracking approach. 
                         In a marked departure from previous approaches, our meshes 
                         approximate the surface through heuristics relying on curvature. 
                         Furthermore, our method works completely on-the-fly, resolving 
                         cracks as it proceeds, without the need for any post-remeshing 
                         step to correct failures. We have tested the algorithm with three 
                         different representations of implicit surfaces, Variational, 
                         analythical and MPU, using non-trivial data sets, yielding results 
                         that illustrate the flexibility and scalability of our technique. 
                         Performance comparisons with variants of Marching Cubes show that 
                         our approach is capable of good accuracy and meshing quality 
                         without sacri¯cing computing resources.",
  conference-location = "Curitiba, PR, Brazil",
      conference-year = "17-20 Oct. 2004",
                  doi = "10.1109/SIBGRA.2004.1352970",
                  url = "http://dx.doi.org/10.1109/SIBGRA.2004.1352970",
             language = "en",
                  ibi = "6qtX3pFwXQZeBBx/Dbc54",
                  url = "http://urlib.net/ibi/6qtX3pFwXQZeBBx/Dbc54",
           targetfile = "4451_de_araujo_B.pdf",
        urlaccessdate = "2024, Apr. 29"
}